Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models

نویسندگان

  • D. Huang
  • T. T. Allen
  • W. I. Notz
  • N. Zheng
چکیده

This paper proposes a new method that extends the Efficient Global Optimization to address stochastic black-box systems. The method is based on a kriging meta-model that provides a global prediction of the objective values and a measure of prediction uncertainty at every point. The criterion for the infill sample selection is an augmented Expected Improvement function with desirable properties for stochastic responses. The method is empirically compared with the Revised Simplex Search, the Simultaneous Perturbation Stochastic Approximation, and the DIRECT methods using six test problems from the literature. An application case study on an inventory system is also documented. The results suggest that the proposed method has excellent consistency and efficiency in finding global optimal solutions, and is particularly useful for expensive systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions

Optimization Involving Expensive Black-Box Objective and Constraint Functions Rommel G. Regis Mathematics Department, Saint Joseph’s University, Philadelphia, PA 19131, USA, [email protected] August 23, 2010 Abstract. This paper presents a new algorithm for derivative-free optimization of expensive black-box objective functions subject to expensive black-box inequality constraints. The proposed al...

متن کامل

A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions

In this paper a new methodology is developed for the solution of mixed-integer nonlinear programs under uncertainty whose problem formulation is complicated by both noisy variables and black-box functions representing a lack of model equations. A branchand-bound framework is employed to handle the integer complexity whereby the solution to the relaxed nonlinear program subproblem at each node i...

متن کامل

A New Framework for Combining Global and Local Methods in Black Box Optimization

We propose a new framework for the optimization of computationally expensive black box problems, where neither closed-form expressions nor derivatives of the objective functions are available. The proposed framework consists of two procedures. The first constructs a global metamodel to approximate the underlying black box function and explores an unvisited area to search for a global solution; ...

متن کامل

A Kriging-based Unconstrained Global Optimization Algorithm

Efficient Global Optimization (EGO) algorithm with Kriging model is stable and effective for an expensive black-box function. However, How to get a more global optimal point on the basis of surrogates has been concerned in simulation-based design optimization. In order to better solve a black-box unconstrained optimization problem, this paper introduces a new EGO method named improved generaliz...

متن کامل

Distance Measures for Permutations in Combinatorial Efficient Global Optimization

For expensive black-box optimization problems, surrogatemodel based approaches like Efficient Global Optimization are frequently used in continuous optimization. Their main advantage is the reduction of function evaluations by exploiting cheaper, data-driven models of the actual target function. The utilization of such methods in combinatorial or mixed search spaces is less common. Efficient Gl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Global Optimization

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2006